Term Orderings for Non-reachability of (Conditional) Rewriting
نویسندگان
چکیده
Abstract We propose generalizations of reduction pairs, well-established techniques for proving termination term rewriting, in order to prove unsatisfiability reachability (infeasibility) plain and conditional rewriting. adapt the weighted path order, a merger Knuth–Bendix lexicographic into proposed framework. The approach is implemented prover , strength our demonstrated through examples experiments.
منابع مشابه
Conditional Term Graph Rewriting
For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...
متن کاملComplexity of Conditional Term Rewriting
We propose a notion of complexity for oriented conditional rewrite systemssatisfying certain restrictions. This notion is realistic in the sense that it measures notonly successful computations, but also partial computations that result in a failed ruleapplication. A transformation to unconditional context-sensitive rewrite systems is pre-sented which reflects this complexity no...
متن کاملTerm Rewriting with Conditionals and Priority Orderings
Conditional re,vriting and priority re,vriting are two recent generalizations of term rewriting systems. In the former, each re\vrite rule is accompanied by an antecedent which must be sho,vn to hold before rewriting can OCCUI. In the latter, re,vrite rules can be used only' in a particular order. We compare these formalisms: neither formalism encompasses the other in a practical sense, but we ...
متن کاملTree lifting orderings for termination transformations of term rewriting systems
A technique to prove the termination of a given term rewriting system (TRS, for short) is presented. We propose tree lifting orderings by which from a given TRS R candidates for the termination of R can be obtained|the termination of (at least) one of these candidates guarantees the termination ofR. It should be remarked that for a given nite TRS all its candidates can be computed automatically...
متن کاملMembership Conditional Term Rewriting Systems
We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) . g(x, y) if x ∈ T ′ yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T ′. We study the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-10769-6_15